Multidestination Message Passing in Wormhole K-ary N-cube Networks with Base Routing Conformed Paths 1

نویسندگان

  • Dhabaleswar K. Panda
  • Sanjay Singal
چکیده

This paper proposes a novel concept of multidestination message passing mechanism for wormhole k-ary n-cube networks. Similar to the familiar car-pool concept, this mechanism allows data to be delivered to or picked-up from multiple nodes with a single message-passing step. Such messages can propagate along any valid path in a wormhole network conforming to the underlying base routing scheme (deterministic or adaptive). The mechanism requires very little modiication to the existing routers and can have unicast message-passing as a subset operation. A base-routing-conformed-path (BRCP) model to implement this mechanism is presented. The model is illustrated for several commonly-used routing schemes and the associated deadlock-freedom properties are analyzed. Using this model a set of new algorithms are proposed and evaluated to implement broadcasting and multicasting. It is shown that these algorithms can considerably reduce the latency of these collective communication operations compared to the Umesh (unicast-based multicast) 22] and the Hamiltonian-Path-based 20] schemes. A very interesting and counter-intuitive result is presented which shows that a mul-ticast can be implemented with reduced or near-constant latency as the number of processors participating in the multicast increases beyond a certain number. It is also shown that the BRCP model can take advantage of routing-adaptivity to reduce the latency of these operations further. These results are the rst ones in the wormhole-routing literature to propose broadcasting and multicasting schemes with such reduced latency on networks with determinis-tic and adaptive routing. The multidestination mechanism and the BRCP model establish a new foundation to provide fast and scalable collective communication support on wormhole-routed systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths

This paper proposes multidestination message passing on wormhole k-ary n-cube networks using a new base-routing-conformed-path (BRCP) model. This model allows both unicast (single-destination) and multidestination messages to co-exist in a given network without leading to deadlock. The model is illustrated with several common routing schemes (deterministic, as well as adaptive), and the associa...

متن کامل

Fast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms1

This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization , respectively. Algorithms for co...

متن کامل

Fast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms

Proc. of the Int'l Symposium on High Performance Computer Architecture (HPCA '95), pp. 200-209. This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to impl...

متن کامل

Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms

This paper presents a new approach to implement global reduction operations in wormhole k-ary n-cubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along each dimension, it is shown that complete global reduction and barrier synchronization operations , as deened by the Message Passing Interf...

متن کامل

Global Reduction in Wormhole K-ary N-cube Networks with Multidestination Exchange Worms 1

This paper presents a new approach to implement global reduction operations (including barrier synchronization) in wormhole k-ary n-cubes. The novelty lies in using multi-destination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along each dimension, it is shown that global reduction and barrier synchronization operations, as deened by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995